Face 2-Colourable Triangular Embeddings of Complete Graphs
نویسندگان
چکیده
منابع مشابه
Triangular embeddings of complete graphs
In this paper we describe the generation of all nonorientable triangular embeddings of the complete graphs K12 and K13. (The 59 nonisomorphic orientable triangular embeddings of K12 were found in 1996 by Altshuler, Bokowski and Schuchert, and K13 has no orientable triangular embeddings.) There are 182, 200 nonisomorphic nonorientable triangular embeddings for K12, and 243, 088, 286 for K13. Tri...
متن کاملTriangular embeddings of complete graphs from graceful labellings of paths
We show that to each graceful labelling of a path on 2s + 1 vertices, s ≥ 2, there corresponds a current assignment on a 3-valent graph which generates at least 22s cyclic oriented triangular embeddings of a complete graph on 12s + 7 vertices. We also show that in this correspondence, two distinct graceful labellings never give isomorphic oriented embeddings. Since the number of graceful labell...
متن کاملQuadrangular embeddings of complete graphs∗
Hartsfield and Ringel proved that a complete graph Kn has an orientable quadrangular embedding if n ≡ 5 (mod 8), and has a nonorientable quadrangular embedding if n ≥ 9 and n ≡ 1 (mod 4). We complete the characterization of complete graphs admitting quadrangular embeddings by showing that Kn has an orientable quadrilateral embedding if n ≡ 0 (mod 8), and has a nonorientable quadrilateral embedd...
متن کاملOn Biembeddings of Latin Squares
A known construction for face 2-colourable triangular embeddings of complete regular tripartite graphs is re-examined from the viewpoint of the underlying Latin squares. This facilitates biembeddings of a wide variety of Latin squares, including those formed from the Cayley tables of the elementary Abelian 2-groups Ck 2 (k 6= 2). In turn, these biembeddings enable us to increase the best known ...
متن کاملA lower bound for the number of orientable triangular embeddings of some complete graphs
We prove that, for a certain positive constant a and for an infinite set of values of n, the number of nonisomorphic face 2-colourable triangular embeddings of the complete graph Kn in an orientable surface is at least nan 2 . AMS classification: 05B07, 05C10.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1998
ISSN: 0095-8956
DOI: 10.1006/jctb.1998.1826